Computations with one and two real algebraic numbers
نویسندگان
چکیده
We present algorithmic and complexity results concerning computations with one and two real algebraic numbers, as well as real solving of univariate polynomials and bivariate polynomial systems with integer coefficients using Sturm-Habicht sequences. Our main results, in the univariate case, concern the problems of real root isolation (Th. 19) and simultaneous inequalities (Cor. 26) and in the bivariate, the problems of system real solving (Th. 42), sign evaluation (Th. 37) and simultaneous inequalities (Cor. 43).
منابع مشابه
Computations with real algebraic numbers of degree up to 4
Our motivation comes from computer-aided design and geometric modeling, where algorithms and predicates rely on computations of real algebraic numbers (usually of small degree). Predicates must be decided exactly in all cases, including degeneracies. In computational geometry there is a growing need for robust manipulation of curved objects (see [2] for a modern approach), since the critical po...
متن کاملACS Algorithms for Complex Shapes with Certified Numerics and Topology Experimental implementation of more operations on algebraic numbers, possibly with the addition of numeric filters, and of robust operations on small polynomial systems
We continue the work in [6] and present our maple implementation of an algebraic toolbox capable of doing computations with one and two real algebraic numbers and real solving bivariate polynomial systems. In addition we describe new functions of the subpackage of the C++ library synaps for root isolation of univariate and multivariate polynomials. For this implementation we combine symbolic an...
متن کاملAlgebraic Moments – Real Root Finding and Related Topics –
Polynomial root finding is a classical and well studied problem in mathematics with practical applications in many areas. Various relevant questions can be reformulated into the task of finding all common roots of a given system of polynomials in several variables, the so-called algebraic variety or zero set. Traditionally, root finding algorithms are implemented in exact arithmetics over algeb...
متن کاملAlgebraic algorithms and applications to geometry
Real algebraic numbers are the real numbers that are real roots of univariate polynomials with integer coefficients. We study exact algorithms, from a theoretical and an implementation point of view, that are based on integer arithmetic of arbitrary precision, for computations with real algebraic numbers and applications of these algorithms on problems and algorithms in non linear computational...
متن کاملAlgebraic Number Comparisons for Robust Geometric Operations
Motivation: Computations with algebraic numbers are of key importance in several geometric computations. Algebraic numbers arise as solutions to systems of polynomials—a common operation in many geometric applications, particularly those involving curved objects. Polynomials regularly describe the relationships between even basic geometric objects, for example the (squared) distance between two...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/cs/0512072 شماره
صفحات -
تاریخ انتشار 2005